A Planar Parallel Device for Neurorehabilitation
نویسندگان
چکیده
منابع مشابه
Developing a Device for Automated Peritoneal Dialysis
Background: Peritoneal dialysis (PD) is an efficient alternative for hemodialysis. Removal of waste metabolites and excess water from the blood circulation are the two main tasks done during dialysis. These are done by using a filter; in PD, the naturally semi-permeable peritoneal membrane acts as the filter. Automated PD machines control intelligently the operations to enhance the efficiency a...
متن کاملMIME robotic device for upper-limb neurorehabilitation in subacute stroke subjects: A follow-up study.
This study presents results from a randomized controlled clinical trial of the Mirror Image Movement Enabler (MIME) robotic device for shoulder and elbow neurorehabilitation in subacute stroke patients, including data on the use of its bilateral training mode. MIME incorporates a PUMA 560 robot (Staubli Unimation Inc, Duncan, South Carolina) that applies forces to the paretic limb during unilat...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولEfficient Parallel Algorithms for Planar DAGs
We show that testing reachability in a planar DAG can be performed in parallel in 0(log n log* n) time(0(logn) time using randomization) using 0(n) processors. In general we give a paradigm for reducing a planar DAG to a constant size and then expanding it back. This paradigm is developed from a property of planar directed graphs we refer to as the Poincare index formula. Using this new paradig...
متن کاملEfficient Parallel Algorithms for Planar st-Graphs1
Planar st-graphs find applications in a number of areas. In this paper we present efficient parallel algorithms for solving several fundamental problems on planar st-graphs. The problems we consider include all-pairs shortest paths in weighted planar st-graphs, single-source shortest paths in weighted planar layered digraphs (which can be reduced to single-source shortest paths in certain speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics
سال: 2020
ISSN: 2218-6581
DOI: 10.3390/robotics9040104